On Cartesian Products of Orthogonal Double Covers
نویسندگان
چکیده
Let H be a graph on n vertices and G a collection of n subgraphs of H, one for each vertex, where G is an orthogonal double cover (ODC) of H if every edge of H occurs in exactly two members of G and any two members share an edge whenever the corresponding vertices are adjacent in H and share no edges whenever the corresponding vertices are nonadjacent in H. In this paper, we are concerned with the Cartesian product of symmetric starter vectors of orthogonal double covers of the complete bipartite graphs and using this method to construct ODCs by new disjoint unions of complete bipartite graphs.
منابع مشابه
On absolute generalized Norlund summability of double orthogonal series
In the paper [Y. Okuyama, {it On the absolute generalized N"{o}rlund summability of orthogonal series},Tamkang J. Math. Vol. 33, No. 2, (2002), 161-165] the author has found some sufficient conditions under which an orthogonal seriesis summable $|N,p,q|$ almost everywhere. These conditions are expressed in terms of coefficients of the series. It is the purpose ofthis paper to extend this result...
متن کاملPartial Star Products: A Local Covering Approach for the Recognition of Approximate Cartesian Product Graphs
This paper is concerned with the recognition of approximate graph products with respect to the Cartesian product. Most graphs are prime, although they can have a rich product-like structure. The proposed algorithms are based on a local approach that covers a graph by small subgraphs, so-called partial star products, and then utilizes this information to derive the global factors and an embeddin...
متن کاملA note on orthogonal double covers of complete bipartite graphs by a special class of six caterpillars
We construct orthogonal double covers of Kn,n by Pm+1 ∪∗ Sn−m, where n and m are integers, 2 ≤ m ≤ 10, m ≤ n and Pm+1 ∪∗ Sn−m is a tree obtained from the path Pm+1 with m edges and a star Sn−m with n − m edges by identifying an end-vertex of Pm+1 with the center of Sn−m.
متن کاملNUMBER OF SPANNING TREES FOR DIFFERENT PRODUCT GRAPHS
In this paper simple formulae are derived for calculating the number of spanning trees of different product graphs. The products considered in here consists of Cartesian, strong Cartesian, direct, Lexicographic and double graph. For this purpose, the Laplacian matrices of these product graphs are used. Form some of these products simple formulae are derived and whenever direct formulation was n...
متن کاملCartesian closed subcategories of topological fuzzes
A category $mathbf{C}$ is called Cartesian closed provided that it has finite products and for each$mathbf{C}$-object $A$ the functor $(Atimes -): Ara A$ has a right adjoint. It is well known that the category $mathbf{TopFuzz}$ of all topological fuzzes is both complete and cocomplete, but it is not Cartesian closed. In this paper, we introduce some Cartesian closed subcategories of this cat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Int. J. Math. Mathematical Sciences
دوره 2013 شماره
صفحات -
تاریخ انتشار 2013